Self-stabilizing Deterministic Gathering
نویسندگان
چکیده
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.
منابع مشابه
Self-stabilizing Determinsitic Gathering
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...
متن کاملFault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering - Feasibility Study -
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i....
متن کاملGathering Asynchronous Mobile Robots with Inaccurate Compasses
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...
متن کاملScatter of Weak Robots
In this paper, we first formalize the problem to be solved, i.e., the Scatter Problem (SP). We then show that SP cannot be deterministically solved. Next, we propose a randomized algorithm for this problem. The proposed solution is trivially self-stabilizing. We then show how to design a self-stabilizing version of any deterministic solution for the Pattern Formation and the Gathering problems....
متن کاملWait-Free Gathering of Mobile Robots
The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been studied and solved even for robots that are anonymous, disoriented, memoryless and operate in the semi-synchronous (ATOM) model. However all known solutions require the robots to be faulty-free except for the results...
متن کامل